An Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in E3
نویسندگان
چکیده
منابع مشابه
An efficient algorithm for line clipping by convex polygon
-A new line clipping algorithm against convex window based on a new approach for intersection detection is presented. Theoretical comparisons with Cyrus-Beck's algorithm are shown together with experimental results obtained by simulations. The main advantage of the presented algorithm is the substantial acceleration of the line clipping problem solution and that edges can be oriented clockwise ...
متن کاملA Fast Algorithm for Line Clipping by Convex Polyhedron in E3
A new algorithm for line clipping against convex polyhedron is given. The suggested algorithm is faster for higher number of facets of the given polyhedron than the traditional Cyrus-Beck's and others algorithms with complexity O N ( ) . The suggested algorithm has O N ( ) complexity in the worst case and expected O N ( ) complexity. The speed up is achieved because of "known order" of triangle...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملLine transversals of convex polyhedra in R3
We establish a bound of O(nk), for any ε > 0, on the combinatorial complexity of the setT of line transversals of a collection P of k convex polyhedra in R with a total of n facets, andpresent a randomized algorithm which computes the boundary of T in comparable expectedtime. Thus, when k ¿ n, the new bounds on the complexity (and construction cost) of Timprove upon the previous...
متن کاملA Rigidity Criterion for Non-Convex Polyhedra
Let P be a (non necessarily convex) embedded polyhedron in R, with its vertices on an ellipsoid. Suppose that the interior of P can be decomposed into convex polytopes without adding any vertex. Then P is infinitesimally rigid. More generally, let P be a polyhedron bounding a domain which is the union of polytopes C1, · · · , Cn with disjoint interiors, whose vertices are the vertices of P . Su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 1996
ISSN: 0167-7055,1467-8659
DOI: 10.1111/1467-8659.1510061